A Deterministic Approach to the Protein Design Problem
نویسندگان
چکیده
منابع مشابه
A Deterministic Approach to the Protein Design Problem
We have considered the problem of protein design based on a model where the contact energy between amino acid residues is fitted phenomenologically using the Miyazawa–Jernigan matrix. Due to the simple form of the contact energy function, an analytical prescription is found which allows us to design energetically stable sequences for fixed amino acid residues compositions and target structures....
متن کاملA deterministic approach to the Skorokhod problem
Abstract: We prove an existence and uniqueness result for the solutions to the Skorokhod problem on uniformly prox-regular sets through a deterministic approach. This result can be applied in order to investigate some regularity properties of the value function for differential games with reflection on the boundary.
متن کاملfrom linguistics to literature: a linguistic approach to the study of linguistic deviations in the turkish divan of shahriar
chapter i provides an overview of structural linguistics and touches upon the saussurean dichotomies with the final goal of exploring their relevance to the stylistic studies of literature. to provide evidence for the singificance of the study, chapter ii deals with the controversial issue of linguistics and literature, and presents opposing views which, at the same time, have been central to t...
15 صفحه اولA deterministic global optimization approach for the protein folding problem
A deterministic global optimization algorithm is proposed for locating the global minimum potentialenergy conformationsof oligopeptide chains. The ECEPP/3 detailed potential energy model is utilized to model the energetics of the atomic interactions. The minimization of the total potential energy is formulated on the set of peptide dihedral angles. Based on previous work on the microcluster and...
متن کاملA Deterministic Approach to Nurse Rerostering Problem
When a nurse at a hospital is unable to be in charge of any of his/her assigned shifts, the roster should be rescheduled to cope with it, which is called nurse rerostering problem. In this problem, we are supposed to find a new one which is close to the given as well as satisfies all the constraints that it inherits from nurse scheduling problem which built the roster. It was proved NP-complete...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Macromolecules
سال: 1997
ISSN: 0024-9297,1520-5835
DOI: 10.1021/ma961564j